A majorization penalty method for SVM with sparse constraint
نویسندگان
چکیده
Support vector machine (SVM) is an important and fundamental technique in learning. Soft-margin SVM models have stronger generalization performance compared with the hard-margin SVM. Most existing works use hinge-loss function which can be regarded as upper bound of 0–1 loss function. However, it cannot explicitly control number misclassified samples. In this paper, we idea soft-margin propose a new model sparse constraint. Our strictly limit samples, expressing constraint By constructing majorization function, penalty method used to solve sparse-constrained optimization problem. We apply Conjugate-Gradient (CG) resulting subproblem. Extensive numerical results demonstrate impressive proposed method.
منابع مشابه
A penalty PALM method for sparse portfolio selection problems
In this paper, we propose a penalty proximal alternating linearized minimization method for the large-scale sparse portfolio problems in which a sequence of penalty subproblems are solved by utilizing proximal alternating linearized minimization frame and sparse projection techniques. For exploiting the structure of the problems and reducing the computation complexity, each penalty subproblem i...
متن کاملA better gap penalty for pairwise SVM
SVM-Pairwise was a major breakthrough in remote homology detection techniques, significantly outperforming previous approaches. This approach has been extensively evaluated and cited by later works, and is frequently taken as a benchmark. No known work however, has examined the gap penalty model employed by SVM-Pairwise. In this paper, we study in depth the relevance and effectiveness of SVM-Pa...
متن کاملA New Method for Solving Constraint Satisfaction Problems
Many important problems in Artificial Intelligence can be defined as Constraint Satisfaction Problems (CSP). These types of problems are defined by a limited set of variables, each having a limited domain and a number of Constraints on the values of those variables (these problems are also called Consistent Labeling Problems (CLP), in which “Labeling" means assigning a value to a variable.) Sol...
متن کاملA Penalty Function Algorithm with Objective Parameters and Constraint Penalty Parameter for Multi-Objective Programming
In this paper, we present an algorithm to solve the inequality constrained multi-objective programming (MP) by using a penalty function with objective parameters and constraint penalty parameter. First, the penalty function with objective parameters and constraint penalty parameter for MP and the corresponding unconstraint penalty optimization problem (UPOP) is defined. Under some conditions, a...
متن کاملA Proximal Approach for Sparse Multiclass SVM
Sparsity-inducing penalties are useful tools to design multiclass support vector machines (SVMs). In this paper, we propose a convex optimization approach for efficiently and exactly solving the multiclass SVM learning problem involving a sparse regularization and the multiclass hinge loss formulated by [1]. We provide two algorithms: the first one dealing with the hinge loss as a penalty term,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization Methods & Software
سال: 2023
ISSN: ['1055-6788', '1026-7670', '1029-4937']
DOI: https://doi.org/10.1080/10556788.2022.2142584